منابع مشابه
Linear programming with variable matrix entries
We consider linear programming (continuous or integer) where some matrix entries are decision parameters. If the variables are nonnegative the problem can be easily solved in two phases. It is shown that direct costs on the matrix entries make the problem NP-hard. Finally a strong duality result is provided.
متن کاملSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
متن کاملGeometric Programming Problem with Trapezoidal Fuzzy Variables
Nowadays Geometric Programming (GP) problem is a very popular problem in many fields. Each type of Fuzzy Geometric Programming (FGP) problem has its own solution. Sometimes we need to use the ranking function to change some part of GP to the linear one. In this paper, first, we propose a method to solve multi-objective geometric programming problem with trapezoidal fuzzy variables; then we use ...
متن کاملMatrix Games, Linear Programming, and Linear Approximation
qi = 1, pA ≥ v ≥ Aq. The number v is known as the value of game. The pair (p, q) is known as an equilibrium for the matrix game. As usual, x ≥ 0 means that every entry of the vector x is ≥ 0. We write y ≤ t for a vector y and a number t if every entry of y is ≤ t. We go even further in abusing notation, denoting by y− t the vector obtaining from y by subtracting t from every entry. Similarly we...
متن کاملLinear Programming in Matrix Form
We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm, which has become the basis of all commercial computer codes for linear programming, simply recognizes that much of the information calculated by the simplex method at each iteration, as described in Chapter 2, is not needed. Thus, efficienci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1981
ISSN: 0024-3795
DOI: 10.1016/0024-3795(81)90009-4